Brahms: Byzantine resilient random membership sampling
نویسندگان
چکیده
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Brahms: Byzantine Resilient Random Membership Sampling
We present Brahms, an algorithm for sampling random nodes in a large dynamic systemprone to Byzantine failures. Brahms stores small membership views at each node, and yetovercomes Byzantine failures of a linear portion of the system. Brahms is composed of twocomponents. The first one is a Byzantine-resistant gossip-based membership protocol. Thesecond one uses a novel memory...
متن کاملA Byzantine Resilient Approach to Network Security
This paper describes a joint project between the University of Idaho and the Idaho National Engineering and Environmental Laboratories (INEEL) which addresses solutions to the problem of malicious intrusions in networked systems. A new approach to network security is proposed that is based on technology transfer of methods and algorithms found in restrictive distributed fault-tolerant systems. ...
متن کاملSynthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems
Fault-tolerant distributed algorithms play an increasingly important role in many applications, and their correct and efficient implementation is notoriously difficult. We present an automatic approach to synthesise provably correct fault-tolerant distributed algorithms from formal specifications in linear-time temporal logic. The supported system model covers synchronous reactive systems with ...
متن کاملAn Architecture Study of a Byzantine-Resilient Processor Using Authentication
This architecture study provides the ground work for implementing a new generation of Byzantine resilient processors using authentication. The use of authentication allows a significant reduction in the theoretical requirements necessary for providing Byzantine resilience, or the ability to continue correct operation in the presence of arbitrary or even malicious faults. This decrease in requir...
متن کاملByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning
Distributed machine learning algorithms enable processing of datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the assumption of faultless networks, failures that can render these algorithms nonfunctional indeed happen in the real world. This paper focuses on the problem of Byzantin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2009
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2009.03.008